FS-LiRT—An Inductive Learning Method for Creating Comprehensible Fuzzy Regression Trees

نویسندگان

  • Holger Schöner
  • Mario Drobics
چکیده

s of the FLLL/SCCH Master and PhD Seminar Room 010, Software Park Hagenberg April 7, 2005 Software Competence Center Hagenberg Fuzzy Logic Laboratorium Linz-Hagenberg Hauptstrasse 99 Hauptstrasse 99 A-4232 Hagenberg A-4232 Hagenberg Tel. +43 7236 3343 800 Tel. +43 7236 3343 431 Fax +43 7236 3343 888 Fax +43 7236 3343 434 www.scch.at www.flll.jku.at

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inductive Learning of Fuzzy Regression Trees

In this paper we present a novel approach to datadriven fuzzy modeling which aims to create highly accurate but also easily comprehensible models. This goal is obtained by defining a flexible but expressive language automatically from the data. This language is then used to inductively learn fuzzy regression trees from the data. Finally, we present a detailed comparison study on the performance...

متن کامل

FS-FOIL: an inductive learning method for extracting interpretable fuzzy descriptions

This paper is concerned with FS-FOIL—an extension of Quinlan’s First-Order Inductive Learning Method (FOIL). In contrast to the classical FOIL algorithm, FS-FOIL uses fuzzy predicates and, thereby, allows to deal not only with categorical variables, but also with numerical ones, without the need to draw sharp boundaries. This method is described in full detail along with discussions how it can ...

متن کامل

Extracting Comprehensible Models from Trained Neural Networks

Although neural networks have been used to develop highly accurate classifiers in numerous real-world problem domains, the models they learn are notoriously difficult to understand. This thesis investigates the task of extracting comprehensible models from trained neural networks, thereby alleviating this limitation. The primary contribution of the thesis is an algorithm that overcomes the sign...

متن کامل

Structural Regression Trees 1

In many real-world domains the task of machine learning algorithms is to learn a theory predicting numerical values. In particular several standard test domains used in Inductive Logic Programming (ILP) are concerned with predicting numerical values from examples and relational and mostly non-determinate background knowledge. However, so far no ILP algorithm except one can predict numbers and c...

متن کامل

Structural Stefan Kramer

In many real-world domains the task of machine learning algorithms is to learn a theory for predicting numerical values. In particular several standard test domains used in Inductive Logic Programming (ILP) are concerned with predicting numerical values from examples and relational and mostly non-determinate background knowledge. However, so far no ILP algorithm except one can predict numbers a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005